Rejection-free geometric cluster algorithm for complex fluids.
نویسندگان
چکیده
We present a novel, generally applicable Monte Carlo algorithm for the simulation of fluid systems. Geometric transformations are used to identify clusters of particles in such a manner that every cluster move is accepted, irrespective of the nature of the pair interactions. The rejection-free and nonlocal nature of the algorithm make it particularly suitable for the efficient simulation of complex fluids with components of widely varying size, such as colloidal mixtures. Compared to conventional simulation algorithms, typical efficiency improvements amount to several orders of magnitude.
منابع مشابه
Geometric Cluster Algorithm for Interacting Fluids
We discuss a new Monte Carlo algorithm for the simulation of complex fluids. This algorithm employs geometric operations to identify clusters of particles that can be moved in a rejection-free way. It is demonstrated that this geometric cluster algorithm (GCA) constitutes the continuum generalization of the Swendsen– Wang and Wolff cluster algorithms for spin systems. Because of its nonlocal na...
متن کاملRejection-free Monte Carlo scheme for anisotropic particles.
We extend the geometric cluster algorithm [J. Liu and E. Luijten, Phys. Rev. Lett. 92, 035504 (2004)], a highly efficient, rejection-free Monte Carlo scheme for fluids and colloidal suspensions, to the case of anisotropic particles. This is made possible by adopting hyperspherical boundary conditions. A detailed derivation of the algorithm is presented, along with extensive implementation detai...
متن کاملGeneralized geometric cluster algorithm for fluid simulation.
We present a detailed description of the generalized geometric cluster algorithm for the efficient simulation of continuum fluids. The connection with well-known cluster algorithms for lattice spin models is discussed, and an explicit full cluster decomposition is derived for a particle configuration in a fluid. We investigate a number of basic properties of the geometric cluster algorithm, inc...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملDual Monte Carlo and cluster algorithms.
We discuss the development of cluster algorithms from the viewpoint of probability theory and not from the usual viewpoint of a particular model. By using the perspective of probability theory, we detail the nature of a cluster algorithm, make explicit the assumptions embodied in all clusters of which we are aware, and deene the construction of free cluster algorithms. We also illustrate these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review letters
دوره 92 3 شماره
صفحات -
تاریخ انتشار 2004